Convergence Rate of the Binomial Tree Scheme for Continuously Paying Options

نویسنده

  • GUILLAUME LEDUC
چکیده

Continuously Paying Options (CPOs) form a very natural class of derivatives for hedging risks coming from adverse movements of a continuously traded asset. We study the rate of convergence of CPOs evaluated under the binomial tree scheme when the payout function φ is piecewise C subject to some boundedness conditions. We show that if φ is continuous, the rate of convergence is n−1 while it is n− 1 2 if φ is discontinuous.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The rate of convergence of the binomial tree scheme

We study the detailed convergence of the binomial tree scheme. It is known that the scheme is first order. We find the exact constants, and show it is possible to modify Richardson extrapolation to get a method of order three-halves. We see that the delta, used in hedging, converges at the same rate. We analyze this by first embedding the tree scheme in the Black-Scholes diffusion model by mean...

متن کامل

Pricing the American put using a new class of tight lower bounds

We present new families of lower bounds for the price of the American put option on a dividend paying stock when the stock follows a log normal process and the option can be exercised continuously to a finite horizon . By put call parity, these bounds can be easily converted to bounds on the price of the Ameican call option on a dividend paying stock. By numerically optimizing these bounds, we ...

متن کامل

The Modified Willow Tree Algorithm ∗

We develop a modified willow tree algorithm for option pricing. Our numerical results show that it approximates the true prices more quickly and precisely than the binomial tree, especially in d-factor models for d = 2, 3, 4, 5. A bound on the theoretical rate of convergence of the modified willow tree algorithm is established.

متن کامل

Convergence Analysis of Binomial Tree Method for American-Type Path-Dependent Options∗

The pricing models of American-type path-dependent options are of degenerate parabolic obstacle problems. The binomial tree method is the most popular approach to pricing options. For some special cases, this method is modified in order to make it feasible. The main purpose of this paper is, using numerical analysis and the notion of viscosity solutions, to show the uniform convergence of the b...

متن کامل

Convergence of Binomial Tree Methods for European/American Path-Dependent Options

The binomial tree method, first proposed by Cox, Ross, and Rubinstein [Journal of Financial Economics, 7 (1979), pp. 229–263], is one of the most popular approaches to pricing options. By introducing an additional path-dependent variable, such methods can be readily extended to the valuation of path-dependent options. In this paper, using numerical analysis and the notion of viscosity solutions...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013